Stéphanie Delaune

JCJC É DITION 2011 Projet VIP

Cryptographic protocols Formal and Computational Proofs

Stéphanie Delaune , Steve Kremer and Mark D . Ryan Symbolic bisimulation for the applied pi calculus Research Report LSV - 07 - 14 April 2007

We propose a symbolic semantics for the finite applied pi calculus, which is a variant of the pi calculus with extensions for modelling cryptgraphic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs from the environment. Correctness is maintained by associating with each process a set of constraints on symbolic terms...

Stéphanie Delaune , Steve Kremer and Graham Steel Formal Analysis of

PKCS#11 defines an API for cryptographic devices that has been widely adopted in industry. However, it has been shown to be vulnerable to a variety of attacks that could, for example, compromise the sensitive keys stored on the device. In this paper, we set out a formal model of the operation of the API, which differs from previous security API models notably in that it accounts for non-monoton...

Stéphanie Delaune An Undecidability Result for AGh

We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We are interested in the Abelian groups theory in combination with the homomorphism axiom. We show th...

Results on the case studies

The results presented in this report is a summary of all the experiments that have been performed during the project on the case studies presented in [15].